# Fig. 22.16: fig22_16.py
# Driver to test Tree class.

from TreeModule import Tree

tree = Tree()
values = raw_input(
   "Enter 10 integer values, separated by spaces:\n" )

for i in values.split():
   tree.insertNode( int( i ) )

print "\nPreorder Traversal"
tree.preOrderTraversal()
print

print "Inorder Traversal"
tree.inOrderTraversal()
print

print "Postorder Traversal"
tree.postOrderTraversal()
print

########################################################################## 
# (C) Copyright 2002 by Deitel & Associates, Inc. and Prentice Hall.     #
# All Rights Reserved.                                                   #
#                                                                        #
# DISCLAIMER: The authors and publisher of this book have used their     #
# best efforts in preparing the book. These efforts include the          #
# development, research, and testing of the theories and programs        #
# to determine their effectiveness. The authors and publisher make       #
# no warranty of any kind, expressed or implied, with regard to these    #
# programs or to the documentation contained in these books. The authors #
# and publisher shall not be liable in any event for incidental or       #
# consequential damages in connection with, or arising out of, the       #
# furnishing, performance, or use of these programs.                     #
##########################################################################
